Delivery pacing systems and methods

ABSTRACT

Embodiments provide a delivery pacing solution to keep customers from affecting other customers. The delivery pacing solution need not be predefined or pre-configured for any customer or any particular job or job type and can be implemented in various ways, for instance, in a queue manager or a dynamic ticketing server. In some embodiments, an agent may obtain from a queue an item specifying a destination and determine whether the item has a concurrency parameter for a group associated with the destination. If so, the agent delivers the item to the destination. If not, the agent dynamically determines a concurrency parameter and returns the item to the queue with the concurrency parameter which controls a maximum number of items in the group that can be concurrently processed for delivery to the destination. A queue manager applies a concurrency rule to the item based on the concurrency parameter.

CROSS-REFERENCE TO RELATED APPLICATION(S)

This is a conversion of, and claims a benefit of priority under 35U.S.C. §119 from U.S. Provisional Application No. 61/847,933, filed Jul.18, 2013, entitled “DELIVERY PACING SYSTEM AND METHOD,” which isincorporated by reference as if set forth herein in its entirety,including the appendices.

TECHNICAL FIELD

This disclosure relates generally to information delivery. Moreparticularly, embodiments disclosed herein relate to new systems,methods, and computer program products for delivery pacing.

BACKGROUND

In the context of push deliveries such as cloud fax services, a systemmay comprise one or more server machines connected to a number of linesfor servicing requests to send and receive faxes. The number of linesmay be predetermined or fixed. One issue the system may need to addressis volume. When a client has many requests that need to be serviced,deliveries to other clients connected to the system may be adverselyaffected—for instance, faxes to other clients may be slowed downed to anunacceptable speed.

Another issue is that a client (e.g., customer A) may be slow inreceiving a delivery or deliveries. This can be caused by variousreasons. For example, a server on the customer A side that is supposedto be receiving the deliveries may be experiencing a problem such as atechnical difficulty and therefore is receiving the deliveries slowly.Suppose the system has X number of “lines” or resources available and alimited of number of processes to handle jobs for all client machinesconnected thereto. If there are X number of jobs outstanding forcustomer A and it takes Y amount of time to process each job becausecustomer A is receiving slowly, then for X amount of time the systemwould be completely booked up and everything else builds up behind it.

A skilled artisan may recognize that there can be various ways toaddress the issues mentioned above. For example, a resource allocationbased solution may try to limit the time and/or number of jobs (incomingor outgoing) that a customer can request at any given time, given thesystem's resources and the number of customers connected to the system.A rule based solution may attempt to prioritize deliveries based on somecustomer-specific and/or job-type prioritization rules. A performancebased solution may involve monitoring and detecting whether a customeris receiving slowly and taking reactive action to try to speed up adelivery or deliveries to that particular customer (e.g., by dedicatingall resources to the slow customer).

These solutions have their shortcomings and drawbacks. For example, theymay require reconfiguration when a new customer is added to the systemand/or place unnecessarily limit(s) on the system and/or thecustomer(s). Consequently, there is room for innovations andimprovements.

SUMMARY OF THE DISCLOSURE

Embodiments of a delivery pacing system, method, and computer programproduct disclosed herein can address the aforementioned issues and more.Since a goal of this disclosure is to provide information deliveryservices to customers with one or more client machines connected to thedelivery pacing system, the terms “customer” and “client” may be usedinterchangeably hereinafter.

As discussed above, a server machine can be connected to a predeterminednumber of lines for servicing different destinations, perhaps belongingto different customers. An object of the invention is to keep customersfrom affecting other customers. As described below, these and otherobjects of the invention can be realized by way of a delivery pacingsolution that does not need to be predefined or pre-configured for anycustomer or any particular job or job type. The delivery pacing solutiondisclosed herein can be implemented in various ways, for instance, in aqueue manager.

In some embodiments, a delivery pacing method may comprise obtaining, byan agent from a queue, an item specifying a destination and determiningwhether the item has a concurrency parameter for a group associated withthe destination. If the item has a concurrency parameter for a groupassociated with the destination, the agent delivers the item to thedestination. Otherwise, the agent dynamically determines a concurrencyparameter for the item and returns the item to the queue with theconcurrency parameter. In some embodiments, an item can be a document,fax, file, message, or piece of information.

In some embodiments, a concurrency parameter for a group controls amaximum number of items in the group that can be concurrently processedby a server machine for delivery to a destination. In some embodiments,the agent can be one of a plurality of background processes running onthe server machine. In some embodiments, a group can be one of aplurality of destination groups associated with different destinations.The concurrency parameter of each destination group of the plurality ofdestination groups controls a maximum number of items in eachdestination group that can be concurrently processed for delivery to arespective destination. A queue manager applies a concurrency rule to anitem in the queue that it manages based on a concurrency parameterassociated with the item. In some embodiments, the queue manager appliesthe concurrency rule to the item independently of a priority valueassociated with the item.

In some embodiments, the delivery pacing method is performed when aconcurrency setting in a delivery system is enabled. If concurrency isnot enabled, an item may be delivered to a destination withoutprocessing its concurrency parameter.

One embodiment comprises a system comprising a processor and anon-transitory computer-readable storage medium that stores computerinstructions translatable by the processor to perform a delivery pacingmethod substantially as described herein. Another embodiment comprises acomputer program product having a non-transitory computer-readablestorage medium that stores computer instructions translatable by aprocessor to perform a delivery pacing method substantially as describedherein.

Numerous other embodiments are also possible.

These, and other, aspects of the disclosure will be better appreciatedand understood when considered in conjunction with the followingdescription and the accompanying drawings. It should be understood,however, that the following description, while indicating variousembodiments of the disclosure and numerous specific details thereof, isgiven by way of illustration and not of limitation. Many substitutions,modifications, additions and/or rearrangements may be made within thescope of the disclosure without departing from the spirit thereof, andthe disclosure includes all such substitutions, modifications, additionsand/or rearrangements.

BRIEF DESCRIPTION OF THE DRAWINGS

The drawings accompanying and forming part of this specification areincluded to depict certain aspects of the disclosure. It should be notedthat the features illustrated in the drawings are not necessarily drawnto scale. A more complete understanding of the disclosure and theadvantages thereof may be acquired by referring to the followingdescription, taken in conjunction with the accompanying drawings inwhich like reference numbers indicate like features.

FIG. 1 depicts a diagrammatic representation of an exemplary environmentin which an information delivery system may be implemented. In thisexample, concurrency is not enabled.

FIG. 2 depicts a diagrammatic representation of an example of aninformation delivery system having a queue manager according to oneembodiment. In this example, concurrency is enabled.

FIG. 3 depicts a diagrammatic representation of an example of aninformation delivery system having ticketing server according to oneembodiment. In this example, concurrency is enabled.

FIG. 4 depicts a flow diagram illustrating an example of a controlmechanism for processing queue items according to one embodiment.

FIG. 5 depicts a diagrammatic representation of a queue item andrelationships between its owner and its client according to oneembodiment.

FIG. 6A depicts a state diagram illustrating a normal flow forprocessing a queue item according to one embodiment.

FIG. 6B depicts a state diagram illustrating a complex flow forprocessing a queue item according to one embodiment.

FIG. 7 depicts a flow diagram illustrating an example of a process flowfor a delivery agent with concurrency enabled according to oneembodiment.

FIG. 8 depicts a flow diagram illustrating an example of a queuemanager's response according to one embodiment.

FIG. 9 depicts a diagrammatic representation of an example of a queueset up according to one embodiment in which a queue is populated withitems to be delivered.

FIG. 10 depicts a diagrammatic representation of an example of queueprocessing for concurrency according to one embodiment.

FIG. 11 depicts a flow diagram illustrating an example of a process flowfor a delivery agent with concurrency enabled according to oneembodiment.

FIG. 12 depicts a flow diagram illustrating an example of a ticketserver's response according to one embodiment.

FIG. 13 depicts a diagrammatic representation of a data processingsystem for implementing portions and components of an informationdelivery system.

DETAILED DESCRIPTION

The invention and the various features and advantageous details thereofare explained more fully with reference to the non-limiting embodimentsthat are illustrated in the accompanying drawings and detailed in thefollowing description. Descriptions of well-known starting materials,processing techniques, components and equipment are omitted so as not tounnecessarily obscure the invention in detail. It should be understood,however, that the detailed description and the specific examples, whileindicating some embodiments of the invention, are given by way ofillustration only and not by way of limitation. Various substitutions,modifications, additions and/or rearrangements within the spirit and/orscope of the underlying inventive concept will become apparent to thoseskilled in the art from this disclosure.

Embodiments disclosed herein are directed to a system configured forproviding information (e.g., faxes, files, documents, or the like)delivery services to a plurality of clients. The system may implement apacing algorithm that can keep customers from affecting other customers.The pacing algorithm does not have to be predefined or pre-configuredfor any customer or any particular job or job type. The pacing algorithmcan be implemented in various ways. For the purpose of illustration andnot of limitation, this disclosure describes two example implementationsin detail, one involving a queue manager and another involving a dynamicticketing server.

FIG. 1 depicts a diagrammatic representation of exemplary computingenvironment 100 in which embodiments of delivery pacing systems may beimplemented and, in particular, one in which concurrency is not enabled.As shown, information delivery system 120 is communicatively coupled viaa plurality of communication links 115 to one of more customers 110,e.g., Company A, Company B, etc. Information delivery system 120 may beimplemented as one or more server machines. The information deliverysystem is likewise communicatively coupled via another plurality ofcommunication links 125 to deliver items of information 122 to one ormore destinations 130.

FIG. 2 depicts a diagrammatic representation of exemplary computingenvironment 200 in which embodiments of delivery pacing systems may beimplemented and, in particular, one in which concurrency is enabled in aqueue manager implementation. In this example, information deliverysystem 220 is communicatively coupled via a plurality of communicationlinks 215 to a plurality of customers 210, e.g., Company A, Company B,etc. Information delivery system 220 is also coupled via a plurality ofcommunication links 225 to a plurality of destination groups 230 (e.g.,Destination Group A, Destination Group B, . . . , Destination Group Z).In this case, information delivery system 220 includes a plurality ofsoftware delivery agents 250. In some embodiments, agents 250 areassociated with queues 260 and queue managers 270, as will be discussedin greater detail below.

FIG. 3 depicts a diagrammatic representation of exemplary computingenvironment 300 in which embodiments of delivery pacing systems may beimplemented and, in particular, one in which concurrency is enabled in adynamic ticketing server implementation. In this example, informationdelivery system 320 is communicatively coupled via a plurality ofcommunication links 315 to a plurality of customers 315, e.g., CompanyA, Company B, etc. Information delivery system 320 is also coupled via aplurality of communication links 325 to a plurality of destinationgroups 230 (e.g., Destination Group A, Destination Group B, . . . ,Destination Group Z). In this case, information delivery system 320includes dynamic ticket server 340 and a plurality of software deliveryagents 350. The agents are associated with queues 360 and queue managers370, as will be discussed in greater detail below.

In some embodiments, agents 350 may be implemented as delivery softwareagents, including web services delivery agent (WSDA) and ftp pushdelivery agent (FPDA). A WSDA sends documents via web service calls anda FPDA sends documents via file transfer protocol (FTP). Web servicesand FTP are known to those skilled in the art and thus are not furtherdescribed herein. The agents may be implemented as background processes.

FIG. 4 depicts a flow diagram illustrating an example of controlmechanism 400 for processing queue items. In operation, as shown in FIG.4, a system may determine if concurrency is enabled (step 405). If not,then queue items will be processed one at a time with no limit onsimultaneous connections to a single host destination (step 410).Otherwise, however, concurrency functions such as those in FIGS. 2 and 3will be implemented (step 420). In particular, a maximum concurrencywill be determined on a per group basis, each group having one or morehost destinations.

Before describing example implementations in detail, it may be helpfulto discuss what a queue item entails, its relationships with its ownerand its client, and the various states that it may be in while it isbeing processed.

In this disclosure, the term “queue item” refers to an item in a queue.A queue item may have a data structure is the basic object beingmanipulated by the underlying queue management system. In someembodiments, a queue item data structure may comprise several types ofdata:

-   -   Data elements which provide data required by the queue manager,        for instance:    -   Data elements which are somewhat specific to a particular        computing environment such as the Cross Domain Discovery Service        (XDDS) environment. XDDS is known to those skilled in the art        and thus is not further described herein.    -   A variable keyword/value pair area which may be used to pass        other application specific data.

An example of a detailed description of structure data members can befound in Table 1 below.

TABLE 1 Data Item Name Description service_class The XDDS service classof the item, this is a prioritization field. In one embodiment, thelower the value, the higher the priority. The exact values are notchecked by the server; however, there are the following predefinedvalues (in priority order): QM_CLASS_OPER for operator requested (highpriority) functions. QM_CLASS_EXPRESS_BCAST for normal express broadcastjobs. QM_CLASS_EXPRESS_P2P for normal express point to point jobs.QM_CLASS_OFFPEAK_BCAST for normal offpeak broadcast jobs.QM_CLASS_OFFPEAK_P2P for normal offpeak point to point jobs. This is notan exhaustive list of the possible values. Others may also be definedand maybe even given #define macros. In some XDDS systems, items can beset with a fixed value and the prioritization of queue items can be setby the priority field (see below). The QM_CLASS_OPER is used to ensurethat these items are at a higher priority than typical items on a queue.priority Within a service class, the priority of an item is determinedby this field. In one embodiment, the lower the number, the higher thepriority. The combination of class and priority can determine where anitem is placed on a queue. qid This is the principle identifier of theitem and is assigned by the queue manager. qstatus This field reflectsthe status of the item from the queue manager viewpoint. astatus Thisfield reflects the status of the item set by a client application whenthe item is completed. The queue manager does not use this field andjust copies it around. By convention, 0 indicates no error. update_cntThis field is used by the queue manager to validate that a requeueoperation is being performed with the latest copy of the item. If arequeue is attempted, and the queue item has been modified since thecopy being requeued, the requeue operation is denied with aQMERR_STALE_ITEM error. Applications should not attempt to modify thisfield directly and should get a fresh copy of the item prior tomodification and requeue. hdrno This field is not used by the queuemanager. It is provided for use by applications. docno This field is notused by the queue manager. It is provided for use by applications. jobnoThis field is not used by the queue manager. It is provided for use byapplications. If used, it should contain a job number. subjobno Thisfield is not used by the queue manager. It is provided for use byapplications. If used, it should contain a sub-job number. seekpos Thisis used internally by the queue manager. Applications should not attemptto modify it (however, modification is harmless). qtime This is to trackthe time that the item was first placed on the queue. queue The name ofthe queue upon which this item resides. In one embodiment, this stringis limited to 31 bytes in length. This is a 32 character array andincludes a terminating ‘\0’ character. owner The queue manager clientname of the owner of this item. The owner is usually either the entitywhich created the item, or the one which is doing the completion sideprocessing for the item, depending on the qstatus of the item. clientThe queue manager client name of the client of this item. The client isusually the entity which processed the item. keys A linked list ofkeyword/value pairs associated with the item. This provides the variableportion of a queue item. Functions are provided to access/modify thekeyword/value pairs. mtime The last modification time of the queue item.This is maintained by the queue manager. alarm If the item is in thepending state, there can be two possible meanings, depending on thesetting of the auto_pend queue manager option for this queue. Thedefault for the auto_pend feature is OFF. 1. auto_pend OFF (default):The number of seconds during which an item may remain unmodified withoutgoing into the alarmed state. A value of 0 disables the alarm feature.2. auto_pend ON: The number of seconds during which an item may remainin the hold qstatus un-modified without going into the pending state.This allows for retries by placing held items back into the pendingstate at a pre-determined time. If the item is in the complete state,there can be two possible meanings, depending on the setting of theauto_complete queue manager option for this queue. The default for theauto_complete feature is ON. 1. auto_complete OFF: The number of secondsduring which an item may remain un-modified without going into thealarmed state. A value of 0 disables the alarm feature. 2. auto_completeON (default): The number of seconds during which an item may remain inthe complete_hold qstatus un-modified without going into the completestate. This allows for retries by placing held items back into thecomplete state at a pre-determined time. If the item is in any otherstate, all states other than hold and complete_hold are treated asfollows: The number of seconds during which an item may remainun-modified without going into the alarmed state. A value of 0 disablesthe alarm feature. A value of 0 disables the alarm feature.

FIG. 5 depicts a diagrammatic representation of an example queue item560 and example relationships 500 between its owner 501 and its client502 according to one embodiment. A queue manager can be viewed as acommunication link between two or more processes (e.g., via a queuemanager application programming interface (API)).

For any given queue item, there are two programs—an owner and a client.The owner of a queue item is the application which caused the queue itemto be placed on the queue. Referring to FIG. 6A, which depicts a statediagram illustrating normal queue item flow 600 for processing a queueitem (e.g., queue item 560 shown in FIG. 5), the application whichcaused the queue item to go into the “pending” state is referred to asthe owner (e.g., owner 501 shown in FIG. 5) of the queue item. The owneris expected to reclaim the queue item as it is completed. However, thesame process is not required to reap the completed queue item. Theclient of the queue item (e.g., client 502 shown in FIG. 5) is theapplication which caused the queue item to go into the “active” state(or the “hold” state, see FIG. 6B). The client is expected to dequeuethe queue item from the “pending” state, process them, and finallycomplete the queue item. Table 2 below shows the normally expected flowof an item in a queue, according to one embodiment.

TABLE 2 Owner Client {owner prepares request using qm_init_item( ) orqm_copy_item( ) and changing the details of the item} qm_queue( )qm_dequeue(QMS_QSTATUS_PENDING) {Client Processes the request}qm_complete( ) {possibly different owner process}qm_dequeue(QMS_QSTATUS_COMPLETE) {owner does any cleanup processing}qm_destroy( )

Those skilled in the art will appreciate that processing of queue itemscan be implemented in various ways. FIG. 6B depicts a state diagramillustrating complex queue item flow 605 for processing a queue itemaccording to one embodiment.

Some embodiments of a queue manager supports an event notificationmechanism where a client can inform the server implementing the queuemanager that they are waiting for items and the server will then notifythe client when a queue item enters the appropriate state to satisfy theevent. This feature can limit the number of polled requests that thequeue manager must service.

A variety of conditions are event-able. In some embodiments, the mostcommonly used ones deal with notification of arrival of queue items intoa particular state. These are shown in Table 3 below.

TABLE 3 Operation #define Notes QM_OP_GET_PENDING This event allows theclient to be notified of items arriving on the queue into the pendingstate. As with qm_dequeue( ), only items on the exact sub-queue areconsidered eligible. This is generally used by client programs.QM_OP_GET_COMPLETE The client is notified when items enter the completestate. This is generally used by owner programs.QM_OP_GET_COMPLETE_OWNER This is similar to the QM_OP_GET_COMPLETE;however, the owner field of the queue item is checked to see if itmatches the supplied argument owner field. QM_OP_GET_CANCEL The clientis notified of items arriving into the QMS_QSTATUS_CANCEL state.QM_OP_STATUS_CHG The client is notified of modifications to the queue.The minimum time period between events can be controlled byconfiguration of the queue. QM_OP_GOING_DOWN The client is notified whenthe queue manager has entered a quiesced (temporarily inactive orinhibited) state. This may be used internally to the client code tomodify certain behavior. This feature can increase the rate ofre-registration attempts, to enable quicker re-syncing to the nextinstance of the queue manager.

Some embodiments of a queue manager can support an active cancellationmechanism. In some embodiments, this can be done via an API functionthat allows notification of cancellation of a queue item to be sent to awaiting client application. The effect on the specified queue item maydepend on the status of the original queue item, as illustrated in Table4 below.

TABLE 4 Queue Item State Description Pending If the queue item is in thepending state, a qm_cancel_item( ) call will remove the item from thequeue, and return an indication that this was the outcome. Active If thequeue item is in the active state, a qm_cancel_item( ) call will cause anew queue item to be created and placed into the CANCEL_PENDING state.From here, either qm_dequeue( ) or event driven mechanisms will allowthe item to be retrieved immediately (to the CANCEL_ACTIVE state), usingnew event and state definitions. In essence, this creates a new set ofstates into which a queue item may reside, e.g., CANCEL_PENDING andCANCEL_ACTIVE. These are similar to the PENDING/ACTIVE andCOMPLETE/COMPLETE_ACTIVE state pairs. The next state may be destroyed,or complete, depending on the nature of the applications. Complete Noaction will be taken. Complete Active No action will be taken. DestroyedAn error will be returned. Hold The item will be treated as if it werein the PENDING state. Complete Hold The item will be treated as if itwere in the COMPLETE state.

There are cases where the number of items that are allowed to bedequeued into the active state (e.g., the “QMS_QSTATUS_ACTIVE” state) atany one time should be limited. This limitation can be controlled at theserver side via a concurrency limiting feature where a queue managerkeeps track of how many items are outstanding in the active state tolimit the number of resources used for a particular function. In someembodiments, this tracking is implemented by a queue manager keepingtrack of the number of queue items outstanding that contain identical(perhaps case insensitive) values in a pre-configure keyword.

In some embodiments, this feature can be turned on for a queue byincluding the concurrency option in a queue_options definition file forthe queue. The value of the option can be the name of a keyword in aqueue item is to be used to track concurrency. An example queue configwould look like:

jmon: bs=8000 sync=no concurrency=group

This tells the queue manager to enable concurrency tracking and that thekeyword to be used is called “group”. Any keyword may be used; however,it must not conflict with keywords used for other purposes. For example,domain may not likely be a good choice as the system may expand to usethat as a more general keyword.

The limit of concurrently active items is not identified via the queueconfiguration. The limit is much more dynamic and is allowed to bespecified on a per concurrency keyword (in this example, “group”) basis.Any item containing the keyword “group” is inspected to see if it alsocontains a keyword that is the same as the concurrency keyword (e.g.,“group”) with the string “_limit” appended to it. If so, the limit forthat specific value of the concurrency keyword is set to the value ofthe “_limit” keyword. If the “_limit” keyword does not exist in thequeue item, it will default to 5. This default limit is configurable andmay vary from implementation to implementation. As a specific example,if the concurrency keyword is “group” and a queue item contains thefollowing:

group: xpedite.com

group_limit: 10

In this example, the effect is that any attempt to dequeue (e.g.,qm_dequeue(QMS_QSTATUS_PENDING)) will not return a queue item if thenumber of outstanding items for the group “xpedite.com” is already 10 ormore. Items for other groups that have not yet reached their limitwill/may be returned. Effectively, the queue manager ignores items inthe pending state (e.g., the “QMS_QSTATUS_PENDING” state) if the grouphas reached its limit during attempts to dequeue items from the queue.

Here, it is the queue items themselves that specify the concurrencylimit. If many items are on the queue for a given group, and they havedifferent “_limit” values, the limit is set by the newest queue item tobe put into the pending state on the queue for the given group. Morespecifically, the limit value is tracked in the queue manager on a “perqueue, per group” basis. It is only updated when items go into thepending state (e.g., the “QMS_QSTATUS_PENDING” state, either byqm_queue( )or later by qm_requeue( )). This means that the limit for anygiven group is set by the newest queue item to be put into the pendingstate on the queue for that group. This allows the value for theconcurrency limit to change and the new value will apply to all existingqueue items (even if they have a different “_limit” value). This way,the last item that moved into the pending state will determine the limitfor all queue items on the queue for the associated group.

In some embodiments, the concurrency limit can apply to all items on aqueue (and all sub-queues). In some embodiments, this is tracked at thequeue level. Thus, no matter which sub-queue the items are on, itemswill be subject to the limit based on all items on the queue.

In some embodiments, any items on the queue in the pending state that donot contain the concurrency keyword (e.g., “group” in the above example)will be allowed to be dequeued without limit. More specifically, aclient may dequeue an item, determine that the concurrency limit valueshave not been set, add the appropriate values, and requeue back in thepending state so the concurrency limitation feature will apply to theitem.

In some embodiments, it is also possible to have the entity creating thequeue items to set the concurrency limit values so they would not needto be changed. This implementation can be more efficient, although thecontrol of the concurrency feature is at another component of the system(for instance, jmon, see the example queue config discussed above).

In some cases, it may be necessary to disable the concurrency feature ina running system. To this end, a concurrency turnoff mechanism has beencreated to allow the concurrency feature to be turned off while thequeue manager is running. The queue manager keeps the required data toimplement the concurrency feature only as items are queued/dequeued andonly when the concurrency feature is turned on. Once the concurrencyfeature has been turned off, one way to get it turned back on again isto bounce the queue manager. This is not persisted—if the concurrencyfeature should not be turned back on when the queue manager is bounced,the queue manager configuration needs to be changed to remove theconcurrency feature.

In some embodiments, a concurrency turnoff mechanism may be implementedas follows. If an item is enqueued to a queue, in the pending state,with a predetermined keyword (e.g., “turn_off_concurrency”), theconcurrency feature will be turned off and no further limitation willtake place. In this case, the value associated with the keyword is notused, it is the existence of the keyword that matters. As an example, asequence required in a queue manager control function (e.g., “qmctl”) toaccomplish this can be:

queue <queuename> oper <operator> new set key turn_off_concurrency yesset qstatus pend enqueue

From a qmctl viewpoint, it will show that an item was queued (but itreally wasn't) and then report that it could not get a copy of it afterit was created:

item was queued could not re-get queued item, [qerrno 9: Qid not foundon queue [jmon]] Usage: enq[ueue] [ <queue_name> ]

When an item is dequeued from a queue, the queue manager dequeue logicwalks the prioritized collection looking for the first item that matchesthe criteria (e.g., owner, matching, etc . . . ). It is possible forthis to force the queue manager to walk many items prior to finding onethat can be dequeued, causing a performance issue.

To minimize this effect for the concurrency feature, the queue managercan keep track of the highest priority queue item for each concurrencykeyword (e.g., “group”). When the dequeue logic finds an item that isnot eligible due to its group having hit the limit of items allowed, itwill can skip all items in that group and locate the next highestpriority item that is not part of that group. This means that the queuemanager will only visit one queue item per concurrency keyword (per“group” in this example). This allows it to skip many high priorityitems looking for a group that is available to be dequeued.

Note that each time an item is actually dequeued, the dequeue logicwalks the list looking for the next highest priority item in that group(so as to keep track of it). Since this ordered search starts at thequeue item that is being dequeued, a very small set of items is expectedto be inspected.

This efficiency optimization can allow the queue manager to continue toprovide high performance even when a small number of concurrency values(e.g., “group”) are not keeping up with delivery (for instance, due toresource constraints of any form). A large number of high priority itemsqueued for a single concurrency value will not interfere withperformance to any large degree. At most, the queue manger will inspectone item per distinct concurrency keyword value.

Non-limiting, example implementations will now be described in detailwith reference to FIGS. 7-12.

FIG. 7 depicts a flow diagram illustrating an example of process flow700 for a delivery agent of an information delivery system withconcurrency enabled in a queue manager implementation (see FIG. 2). Anagent will obtain or receive a queue item from a queue (step 701). Insome embodiments, the queue item specifies a destination. The agent thenmay determine whether the queue item has a concurrency parameter for agroup associated with the destination (step 703). If the queue item hasa concurrency parameter for the group, the agent will deliver the queueitem to the destination (step 709). Otherwise, if the agent does nothave a concurrency parameter for the group, the agent will dynamicallydetermine a concurrency parameter for the queue item (step 705) andreturn the queue item to the queue with the concurrency parameter (step707). A queue manager will then apply a concurrency rule to the queueitem based on the concurrency parameter.

FIG. 8 depicts a flow diagram illustrating an example of a queuemanager's response 800. In this case, a queue manager receives a queueitem returned from an agent (step 801) and reads the queue item'sconcurrency parameter for the group (step 803). The queue manager willthen apply the concurrency rule to the queue item (step 805), as furtherexemplified below with reference to FIGS. 9-10.

FIG. 9 depicts a diagrammatic representation of an example of a queueset up in which a queue is populated with items to be delivered by aninformation delivery system. It illustrates new items being added to thequeue and what happens when a new item comes in that has a higherpriority than an existing item. In some embodiments, priority does notchange delivery pacing. If a queue item cannot be delivered, it isplaced back in the queue in accordance with the same priority order.

For example, if a new item for a.com arrive and has a priority of 10, itwill be added to the queue (step 901, shown at queue contents). A nextnew item for b.com with a priority of 8 is added to the queue ahead ofthe item for a.com, since it has higher priority (step 903). A next itemfor c.com having a priority of 12 is then added below the items fora.com and b.com (step 905), and so forth (steps 907, 909, 911, 913, 915,917, 919, and 921). Items having a level of priority intermediate tothose of items in the queue will be inserted in order of priority. Forexample, at step 917, the item for b.com with priority of 16 will beinserted into the queue between the item for a.com with priority of 15and the item for a.com with priority of 18.

FIG. 10 depicts a diagrammatic representation of an example of queueprocessing for concurrency in an example of an information deliverysystem. Specifically, it shows the sequence of queue item processingthat occurs when a set of delivery agents processes the items in thequeue with concurrency rules in place. The diagram shows which items arebeing processed by agents at any given point in the flow, and noteswhich items are delayed because of concurrency limits.

In the example illustrated in FIG. 10, the information delivery systemhas a default concurrency of 2, although destination a.com has apredefined concurrency of 3. In the example illustrated, there are fiveagents. The dashed lines indicate items currently being processed by anagent. In this example, therefore, there can be a maximum of five itemswith dashed lines at any given time. The shaded items are those whichcannot be processed due to the concurrency limit.

As illustrated in FIG. 10, initially, the agents are processing itemsb.com (8), a.com (10), c.com (12), a.com (15), and b.com (16) (step1001). If c.com (12) is processed out, then a.com (18) will move up inthe queue to be processed (step 1003). When b.com (8) is processed,b.com (20) moves up in the queue (step 1005). When b.com (16) isprocessed, c.com (25) moves up in the queue (step 1007). The items havebeen able to be processed because the concurrency levels for thecorresponding destinations have not been exceeded (i.e., only two orfewer than two items for b.com and c.com and only three or fewer thanthree items for a.com have been present at the top of the queue). Withthe processing of c.com (25), a.com (30) should move up and beprocessed. However, since three items are already being concurrentlyprocessed, item a.com (30) cannot be processed and so item c.com (35)will be processed in its place (step 1009). When b.com (20) is processedout, the next item in line is a.com (40). However, since there are stillthree a.com items, item a.com (40) cannot be processed, and so itemb.com (45) gets processed instead (step 1011).

When item c.com (35) gets processed out item a.com (50) should beprocessed next but, again, three items are still being processed fora.com. Consequently, item b.com (55) gets processed (step 1013). Whenitem a.com (10) gets processed out, item a.com (30) may now beprocessed, although item a.com (40) and a.com (50) still cannot beprocessed due to concurrency (step 1015). When item a.com (15) getsprocessed out, item a.com (40) may be processed, although item a.com(50) still cannot be processed (step 1017). When item a.com (18) isprocessed out, item a.com (50) may be processed (step 1019).

When item b.com (45) is processed out, item c.com (60) moves up forprocessing (step 1021). When it gets processed out, item a.com (65)moves up, but it cannot be processed because there are already threeitems for a.com (step 1023). When item a.com (30) is processed, itemb.com (70) moves up for processing (step 1025). When item a.com (40)gets processed out, item b.com (75) moves up, but it cannot be processedbecause two items are already being processed for b.com (step 1027).Item a.com (50) may then be processed out, but item b.com (75) still maynot be processed because of the two b.com items still being processed(step 1029). Finally, when item b.com (55) is processed out, item b.com(75) may be processed (step 1031).

FIG. 11 depicts a flow diagram illustrating an example of process flow1100 for a delivery agent of an information delivery system withconcurrency enabled in a ticket server implementation (see FIG. 3).Initially, the agent obtains or receives a queue item from acorresponding queue (step 1101). The agent determines a destinationgroup for the item (step 1103). In particular, the agent will firstdetermine a host name of a queue item destination (step 1105). If thehost name is not known to the group, the agent will create a new groupfor the item (step 1107). Otherwise, the agent will communicate the itemconcurrency for the destination group to the ticket server (step 1109).In some embodiments, the agent will communicate the maximum concurrencyfor the group to the ticket server and request a ticket for processingthe item (step 1111). In some embodiments, the agent may be configuredwith the maximum concurrency prior to receiving the item. Upon receiptof the ticket, the agent will proceed to deliver the item to thedestination (step 1115) and return the ticket to the ticket server (step1117). If no ticket was received, then the agent will return the item tothe queue (step 1113).

In some embodiments, the agent may further communicate a wait time to anassociated queue manager, i.e., a time that the ticket server told theagent it should wait until there likely would be a ticket availableagain. The wait time may be determined by computing a difference betweena start of a current time slot and current time, the current time slotconfigured to be filled with a predetermined number of ticket requests.In some embodiments, the destination group can be one of a plurality ofdestination groups and the item concurrency of each group controls thedelivery of at least one of the items to the respective group.

FIG. 12 depicts a flow diagram illustrating an example of a ticketserver's response 1200 to a ticket request. As shown, the ticket servermay receive a request for a ticket for a group from an agent (step1201). The ticket server may determine whether the group is known (step1203). If the group is not known to the ticket server, the ticket serverwill create a record for the group for tracking a number of ticketsbeing concurrently processed for the group and a time for each process(step 1205), and will further issue a ticket to the agent and increasethe number of concurrency for the group by one (step 1207).

If the group is known to the ticket server, the ticket server willdetermine if the maximum concurrency for the group has been met (step1209). If not, it will issue a ticket for the agent and increase thenumber of concurrency for the group by one (step 1207). If maximumconcurrency has been met, the ticket server will compute a wait time(step 1211). In some embodiments, the wait time may be based on ahistorical tracking of the time taken to process each ticket for thegroup or an estimated average time the tickets are unavailable. It thencommunicates the computed wait time to the agent (step 1213). Asdescribed above, items in the same group cannot be concurrentlyprocessed if the maximum concurrency limit for the group has been met.The computed wait time provides an estimate as to when a ticket may beavailable for the agent or another agent in the information deliverysystem to process the next item in the group.

FIG. 13 depicts a diagrammatic representation of a data processingsystem for implementing portions and components of an informationdelivery system. As shown in FIG. 13, data processing system 1300 mayinclude one or more central processing units (CPU) or processors 1301coupled to one or more user input/output (I/O) devices 1302 and memorydevices 1303. Examples of I/O devices 1302 may include, but are notlimited to, keyboards, displays, monitors, touch screens, printers,electronic pointing devices such as mice, trackballs, styluses, touchpads, or the like. Examples of memory devices 1303 may include, but arenot limited to, hard drives (HDs), magnetic disk drives, optical diskdrives, magnetic cassettes, tape drives, flash memory cards, randomaccess memories (RAMs), read-only memories (ROMs), smart cards, etc.Data processing system 1300 can be coupled to display 1306, informationdevice 1307 and various peripheral devices (not shown), such asprinters, plotters, speakers, etc. through I/O devices 1302. Dataprocessing system 1300 may also be coupled to external computers orother devices through network interface 1304, wireless transceiver 1305,or other means that is coupled to a network such as a local area network(LAN), wide area network (WAN), or the Internet.

Those skilled in the relevant art will appreciate that the invention canbe implemented or practiced with other computer system configurations,including without limitation multi-processor systems, network devices,mini-computers, mainframe computers, data processors, and the like. Theinvention can be embodied in a general purpose computer, or a specialpurpose computer or data processor that is specifically programmed,configured, or constructed to perform the functions described in detailherein. The invention can also be employed in distributed computingenvironments, where tasks or modules are performed by remote processingdevices, which are linked through a communications network such as aLAN, WAN, and/or the Internet. In a distributed computing environment,program modules or subroutines may be located in both local and remotememory storage devices. These program modules or subroutines may, forexample, be stored or distributed on computer-readable media, includingmagnetic and optically readable and removable computer discs, stored asfirmware in chips, as well as distributed electronically over theInternet or over other networks (including wireless networks). Examplechips may include Electrically Erasable Programmable Read-Only Memory(EEPROM) chips. Embodiments discussed herein can be implemented insuitable instructions that may reside on a non-transitory computerreadable medium, hardware circuitry or the like, or any combination andthat may be translatable by one or more server machines. Examples of anon-transitory computer readable medium are provided below in thisdisclosure.

Although the invention has been described with respect to specificembodiments thereof, these embodiments are merely illustrative, and notrestrictive of the invention. The description herein of illustratedembodiments of the invention, including the description in the Abstractand Summary, is not intended to be exhaustive or to limit the inventionto the precise forms disclosed herein (and in particular, the inclusionof any particular embodiment, feature or function within the Abstract orSummary is not intended to limit the scope of the invention to suchembodiment, feature or function). Rather, the description is intended todescribe illustrative embodiments, features and functions in order toprovide a person of ordinary skill in the art context to understand theinvention without limiting the invention to any particularly describedembodiment, feature or function, including any such embodiment featureor function described in the Abstract or Summary. While specificembodiments of, and examples for, the invention are described herein forillustrative purposes only, various equivalent modifications arepossible within the spirit and scope of the invention, as those skilledin the relevant art will recognize and appreciate. As indicated, thesemodifications may be made to the invention in light of the foregoingdescription of illustrated embodiments of the invention and are to beincluded within the spirit and scope of the invention. Thus, while theinvention has been described herein with reference to particularembodiments thereof, a latitude of modification, various changes andsubstitutions are intended in the foregoing disclosures, and it will beappreciated that in some instances some features of embodiments of theinvention will be employed without a corresponding use of other featureswithout departing from the scope and spirit of the invention as setforth. Therefore, many modifications may be made to adapt a particularsituation or material to the essential scope and spirit of theinvention.

Reference throughout this specification to “one embodiment”, “anembodiment”, or “a specific embodiment” or similar terminology meansthat a particular feature, structure, or characteristic described inconnection with the embodiment is included in at least one embodimentand may not necessarily be present in all embodiments. Thus, respectiveappearances of the phrases “in one embodiment”, “in an embodiment”, or“in a specific embodiment” or similar terminology in various placesthroughout this specification are not necessarily referring to the sameembodiment. Furthermore, the particular features, structures, orcharacteristics of any particular embodiment may be combined in anysuitable manner with one or more other embodiments. It is to beunderstood that other variations and modifications of the embodimentsdescribed and illustrated herein are possible in light of the teachingsherein and are to be considered as part of the spirit and scope of theinvention.

In the description herein, numerous specific details are provided, suchas examples of components and/or methods, to provide a thoroughunderstanding of embodiments of the invention. One skilled in therelevant art will recognize, however, that an embodiment may be able tobe practiced without one or more of the specific details, or with otherapparatus, systems, assemblies, methods, components, materials, parts,and/or the like. In other instances, well-known structures, components,systems, materials, or operations are not specifically shown ordescribed in detail to avoid obscuring aspects of embodiments of theinvention. While the invention may be illustrated by using a particularembodiment, this is not and does not limit the invention to anyparticular embodiment and a person of ordinary skill in the art willrecognize that additional embodiments are readily understandable and area part of this invention.

ROMs, RAMs, and HDs are computer memories for storingcomputer-executable instructions executable by a CPU or capable of beingcompiled or interpreted to be executable by the CPU. Suitablecomputer-executable instructions may reside on a computer readablemedium (e.g., a ROM, a RAM, and/or a HD), hardware circuitry or thelike, or any combination thereof. Within this disclosure, the term“computer readable medium” is not limited to ROMs, RAMs, and HDs and caninclude any type of data storage medium that can be read by a processor.For example, a computer-readable medium may refer to a data cartridge, adata backup magnetic tape, a floppy diskette, a flash memory drive, anoptical data storage drive, a CD-ROM, ROM, RAM, HD, or the like. Theprocesses described herein may be implemented in suitablecomputer-executable instructions that may reside on a computer readablemedium (for example, a disk, CD-ROM, a memory, etc.). Alternatively, thecomputer-executable instructions may be stored as software codecomponents on a direct access storage device array, magnetic tape,floppy diskette, optical storage device, or other appropriatecomputer-readable medium or storage device.

Any suitable programming language can be used to implement the routines,methods or programs of embodiments of the invention described herein,including C, C++, Java, JavaScript, HTML, or any other programming orscripting code, etc. Other software/hardware/network architectures maybe used. For example, the functions of the disclosed embodiments may beimplemented on one computer or shared/distributed among two or morecomputers in or across a network. Communications between computersimplementing embodiments can be accomplished using any electronic,optical, radio frequency signals, or other suitable methods and tools ofcommunication in compliance with known network protocols.

Different programming techniques can be employed such as procedural orobject oriented. Any particular routine can execute on a single computerprocessing device or multiple computer processing devices, a singlecomputer processor or multiple computer processors. Data may be storedin a single storage medium or distributed through multiple storagemediums, and may reside in a single database or multiple databases (orother data storage techniques). Although the steps, operations, orcomputations may be presented in a specific order, this order may bechanged in different embodiments. In some embodiments, to the extentmultiple steps are shown as sequential in this specification, somecombination of such steps in alternative embodiments may be performed atthe same time. The sequence of operations described herein can beinterrupted, suspended, or otherwise controlled by another process, suchas an operating system, kernel, etc. The routines can operate in anoperating system environment or as stand-alone routines. Functions,routines, methods, steps and operations described herein can beperformed in hardware, software, firmware or any combination thereof.

Embodiments described herein can be implemented in the form of controllogic in software or hardware or a combination of both. The controllogic may be stored in an information storage medium, such as acomputer-readable medium, as a plurality of instructions adapted todirect an information processing device to perform a set of stepsdisclosed in the various embodiments. Based on the disclosure andteachings provided herein, a person of ordinary skill in the art willappreciate other ways and/or methods to implement the invention.

It is also within the spirit and scope of the invention to implement insoftware programming or code an of the steps, operations, methods,routines or portions thereof described herein, where such softwareprogramming or code can be stored in a computer-readable medium and canbe operated on by a processor to permit a computer to perform any of thesteps, operations, methods, routines or portions thereof describedherein. The invention may be implemented by using software programmingor code in one or more general purpose digital computers, by usingapplication specific integrated circuits, programmable logic devices,field programmable gate arrays, optical, chemical, biological, quantumor nanoengineered systems, components and mechanisms may be used. Ingeneral, the functions of the invention can be achieved by any means asis known in the art. For example, distributed, or networked systems,components and circuits can be used. In another example, communicationor transfer (or otherwise moving from one place to another) of data maybe wired, wireless, or by any other means.

A “computer-readable medium” may be any medium that can contain, store,communicate, propagate, or transport the program for use by or inconnection with the instruction execution system, apparatus, system ordevice. The computer readable medium can be, by way of example only butnot by limitation, an electronic, magnetic, optical, electromagnetic,infrared, or semiconductor system, apparatus, system, device,propagation medium, or computer memory. Such computer-readable mediumshall generally be machine readable and include software programming orcode that can be human readable (e.g., source code) or machine readable(e.g., object code). Examples of non-transitory computer-readable mediacan include random access memories, read-only memories, hard drives,data cartridges, magnetic tapes, floppy diskettes, flash memory drives,optical data storage devices, compact-disc read-only memories, and otherappropriate computer memories and data storage devices. In anillustrative embodiment, some or all of the software components mayreside on a single server computer or on any combination of separateserver computers. As one skilled in the art can appreciate, a computerprogram product implementing an embodiment disclosed herein may compriseone or more non-transitory computer readable media storing computerinstructions translatable by one or more processors in a computingenvironment.

A “processor” includes any, hardware system, mechanism or component thatprocesses data, signals or other information. A processor can include asystem with a general-purpose central processing unit, multipleprocessing units, dedicated circuitry for achieving functionality, orother systems. Processing need not be limited to a geographic location,or have temporal limitations. For example, a processor can perform itsfunctions in “real-time,” “offline,” in a “batch mode,” etc. Portions ofprocessing can be performed at different times and at differentlocations, by different (or the same) processing systems.

It will also be appreciated that one or more of the elements depicted inthe drawings/figures can also be implemented in a more separated orintegrated manner, or even removed or rendered as inoperable in certaincases, as is useful in accordance with a particular application.Additionally, any signal arrows in the drawings/figures should beconsidered only as exemplary, and not limiting, unless otherwisespecifically noted.

As used herein, the terms “comprises,” “comprising,” “includes,”“including,” “has,” “having,” or any other variation thereof, areintended to cover a non-exclusive inclusion. For example, a process,product, article, or apparatus that comprises a list of elements is notnecessarily limited only those elements but may include other elementsnot expressly listed or inherent to such process, product, article, orapparatus.

Furthermore, the term “or” as used herein is generally intended to mean“and/or” unless otherwise indicated. For example, a condition A or B issatisfied by any one of the following: A is true (or present) and B isfalse (or not present), A is false (or not present) and B is true (orpresent), and both A and B are true (or present). As used herein,including the claims that follow, a term preceded by “a” or “an” (and“the” when antecedent basis is “a” or “an”) includes both singular andplural of such term, unless clearly indicated within the claim otherwise(i.e., that the reference “a” or “an” clearly indicates only thesingular or only the plural). Also, as used in the description hereinand throughout the claims that follow, the meaning of “in” includes “in”and “on” unless the context clearly dictates otherwise.

The scope of the present disclosure should be determined by thefollowing claims and their legal equivalents.

What is claimed is:
 1. A system for delivery pacing, comprising: anagent running on a server machine and configured for: obtaining an itemfrom a queue, the item specifying a destination; determining whether theitem has a concurrency parameter for a group associated with thedestination; if the item has a concurrency parameter for a group,delivering the item to the destination; and if the item does not have aconcurrency parameter for a group: dynamically determining a concurrencyparameter for the item; and returning the item to the queue with theconcurrency parameter; and a queue manager configured for applying aconcurrency rule to the item based on the concurrency parameter.
 2. Thesystem of claim 1, wherein the concurrency parameter for the groupcontrols a maximum number of items in the group that can be concurrentlyprocessed for delivery to the destination.
 3. The system of claim 1,wherein the item is a document, fax, file, message, or piece ofinformation.
 4. The system of claim 1, wherein the group is one of aplurality of destination groups associated with different destinations,wherein the server machine is connected to a predetermined number oflines for servicing the different destinations, and wherein theconcurrency parameter of each destination group of the plurality ofdestination groups controls a maximum number of items in eachdestination group that can be concurrently processed for delivery to arespective destination.
 5. The system of claim 1, wherein the queuemanager applies the concurrency rule to the item independently of apriority value associated with the item.
 6. The system of claim 1,wherein the agent is one of a plurality of background processes runningon the server machine.
 7. A method for delivery pacing, comprising:obtaining, by an agent running on a server machine, an item from aqueue, the item specifying a destination; determining, by the agent,whether the item has a concurrency parameter for a group associated withthe destination; if the item has a concurrency parameter for a group,the agent delivering the item to the destination; and if the item doesnot have a concurrency parameter for a group, the agent: dynamicallydetermining a concurrency parameter for the item; and returning the itemto the queue with the concurrency parameter.
 8. The method according toclaim 7, further comprising: applying, by a queue manager for the queue,a concurrency rule to the item based on the concurrency parameter. 9.The method according to claim 7, wherein the concurrency parameter forthe group controls a maximum number of items in the group that can beconcurrently processed for delivery to the destination.
 10. The methodaccording to claim 7, wherein the item is a document, fax, file,message, or piece of information.
 11. The method according to claim 7,wherein the group is one of a plurality of destination groups associatedwith different destinations, wherein the server machine is connected toa predetermined number of lines for servicing the differentdestinations, and wherein the concurrency parameter of each destinationgroup of the plurality of destination groups controls a maximum numberof items in each destination group that can be concurrently processedfor delivery to a respective destination.
 12. The method according toclaim 7, further comprising: prior to the obtaining, determining whetherconcurrency is enabled; and if the concurrency is not enabled,delivering the item to the destination without processing theconcurrency parameter.
 13. The method according to claim 7, furthercomprising: performing the determining only if concurrency is enabled.14. The method according to claim 7, wherein the queue manager appliesthe concurrency rule to the item independently of a priority valueassociated with the item.
 15. The method according to claim 7, whereinthe agent is one of a plurality of background processes running on theserver machine.
 16. A computer program product comprising at least onenon-transitory computer readable medium storing instructionstranslatable by at least one processor to perform: obtaining an itemfrom a queue, the item specifying a destination; determining whether theitem has a concurrency parameter for a group associated with thedestination; if the item has a concurrency parameter for a group,delivering the item to the destination; and if the item does not have aconcurrency parameter for a group: dynamically determining a concurrencyparameter for the item; and returning the item to the queue with theconcurrency parameter.
 17. The computer program product of claim 16,wherein the at least one non-transitory computer readable medium furtherstores instructions translatable by the at least one processor toperform: applying a concurrency rule to the item based on theconcurrency parameter.
 18. The computer program product of claim 16,wherein the group is one of a plurality of destination groups associatedwith different destinations, wherein the server machine is connected toa predetermined number of lines for servicing the differentdestinations, and wherein the concurrency parameter of each destinationgroup of the plurality of destination groups controls a maximum numberof items in each destination group that can be concurrently processedfor delivery to a respective destination.
 19. The computer programproduct of claim 16, wherein the at least one non-transitory computerreadable medium further stores instructions translatable by the at leastone processor to perform: determining whether concurrency is enabled;and if the concurrency is not enabled, delivering the item to thedestination without processing the concurrency parameter.
 20. Thecomputer program product of claim 16, wherein the concurrency rule isapplied to the item independently of a priority value associated withthe item.